Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems
نویسندگان
چکیده
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the cost factor is only logarithmic in the number of time-steps. As an example, we discuss the solution of the final-value problem for a Fokker–Planck equation whose drift velocity solves a different initial-value problem—a relevant issue in the context of turbulent scalar transport. © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Aerodynamic Design Optimization Using Genetic Algorithm (RESEARCH NOTE)
An efficient formulation for the robust shape optimization of aerodynamic objects is introduced in this paper. The formulation has three essential features. First, an Euler solver based on a second-order Godunov scheme is used for the flow calculations. Second, a genetic algorithm with binary number encoding is implemented for the optimization procedure. The third ingredient of the procedure is...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملData Assimilation Experiments using the Back and Forth Nudging and NEMO OGCM
We present Data Assimilation experiments under the OSSE framework using NEMO ocean model and the Back and Forth Nudging (BFN). This algorithm consists in initially solving the forward equations with a nudging term (forcing term proportional to the difference between the model state and the observations), and then, using the final state as an initial condition, in solving the same equations in a...
متن کاملModified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)
Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...
متن کامل